Continuous tree-like scales

نویسندگان

  • James Cummings
  • Luis Pereira
چکیده

Answering a question raised by Luis Pereira, we show that a continuous tree-like scale can exist above a supercompact cardinal. We also show that the existence of a continuous tree-like scale at אω is consistent with Martin’s Maximum.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Characterisation Of, and Hypothesis Test For, Con- Tinuous Local Martingales

We give characterisations for Brownian motion and continuous local martingales, using the crossing tree, which is a sample-path decomposition based on first-passages at nested scales. These results are based on ideas used in the construction of Brownian motion on the Sierpinski gasket (Barlow & Perkins 1988). Using our characterisation we propose a test for the continuous martingale hypothesis,...

متن کامل

Tight stationarity and tree-like scales

Let κ be a singular cardinal of countable cofinality, 〈κn : n < ω〉 a sequence of regular cardinals which is increasing and cofinal in κ. Using a scale, we define a mapping μ from ∏ n P(κn) to P(κ+) which relates tight stationarity on κ to the usual notion of stationarity on κ+. We produce a model where all subsets of κ+ are in the range of μ for some κ a singular. Using a version of the diagona...

متن کامل

Scaling and Universality in Continuous Length Combinatorial Optimization

We consider combinatorial optimization problems defined over random ensembles and study how solution cost increases when the optimal solution undergoes a small perturbation delta. For the minimum spanning tree, the increase in cost scales as delta2. For the minimum matching and traveling salesman problems in dimension d >/= 2, the increase scales as delta3; this is observed in Monte Carlo simul...

متن کامل

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

Detailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries

In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010